//
// Created by 13194 on 2021/4/27/027.
//

#ifndef BINARY_SEARCH_TREE_TREENODE_H
#define BINARY_SEARCH_TREE_TREENODE_H

#include <iostream>
#include <vector>
using namespace std;

struct TreeNode {
    int val;
    TreeNode *left;
    TreeNode *right;

    TreeNode() : val(0), left(nullptr), right(nullptr) {}

    TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}

    TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
};

#endif //BINARY_SEARCH_TREE_TREENODE_H
